Square Root and Division Elimination in PVS
نویسنده
چکیده
In this paper we present a new strategy for PVS that implements a square root and division elimination in order to use automatic arithmetic strategies that were not able to deal with these operations in a rst place. This strategy relies on a PVS formalization of the square root and division elimination and deep embedding of PVS expressions inside PVS. Therefore using computational re ection and symbolic computation we are able to automatically transform expressions into division and square root free ones before using these decisions procedures.
منابع مشابه
A Certifying Square Root and Division Elimination
This paper presents a program transformation that removes square roots and divisions from functional programs without recursion, producing code that can be exactly computed. This transformation accepts different subsets of languages as input and it provides a certifying mechanism when the targeted language is Pvs. In this case, we provide a relation between every function definition in the outp...
متن کاملA Formal Proof of Square Root and Division Elimination in Embedded Programs
The use of real numbers in a program can introduce di erences between the expected and the actual behavior of the program, due to the nite representation of these numbers. Therefore, one may want to de ne programs using real numbers such that this di erence vanishes. This paper de nes a program transformation for a certain class of programs that improves the accuracy of the computations on real...
متن کاملA Quest for Exactness: Program Transformation for Reliable Real Numbers. (Transformation de Programmes pour des Nombres Réels Fiables)
This thesis presents an algorithm that eliminates square root and division op-erations in some straight-line programs used in embedded systems while pre-serving the semantics. Eliminating these two operations allows to avoid errorsat runtime due to rounding. These errors can lead to a completely unexpectedbehavior from the program. This transformation respects the constraint...
متن کاملFast low-power shared division and square-root architecture
This paper addresses a fast low-power implementation of a shared division and square-root architecture. Two approaches are considered in this paper; these include the SRT (Sweeney, Robertson and Tocher) approach which does not require prescaling and the GST (generalized Svoboda and Tung) approach which requires prescaling of the operands. This paper makes two important contributions. Although S...
متن کاملHigh-Speed Double-Precision Computation of Reciprocal, Division, Square Root and Inverse Square Root
A new method for the high-speed computation of double-precision floating-point reciprocal, division, square root, and inverse square root operations is presented in this paper. This method employs a second-degree minimax polynomial approximation to obtain an accurate initial estimate of the reciprocal and the inverse square root values, and then performs a modified Goldschmidt iteration. The hi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013